Location-allocation models for traffic police patrol vehicles on an interurban network

This research investigates the traffic police routine patrol vehicle (RPV) assignment problem on an interurban road network through a series of integer linear programs. The traffic police RPV’s main task, like other emergency services, is to handle calls-forservice. Emergency services allocation models are generally based on the shortest path algorithm however, the traffic police RPV also handles other roles, namely patrolling to create a presence that acts as a deterrence, and issuing tickets to offenders. The RPVs need to be located dynamically on both hazardous sections and on roads with heavy traffic in order to increase their presence and conspicuousness, in an attempt to prevent or reduce traffic offences, road accidents and traffic congestion. Due to the importance of the traffic patrol vehicle’s location with regard to their additional roles, allocation of the RPVs adheres to an exogenous, legal, time-to-arrival constraint. We develop location-allocation models and apply them to a case study of the road network in northern Israel. The results of the four models are compared to each other and in relation to the current chosen locations. The multiple formulations provide alternatives that jointly account for road safety and policing objectives which aid decision-makers in the selection of their preferred RPV assignments. The results of the models present a location-allocation configuration per RPV per shift with N. Adler · J. Kornbluth · M. Sher ( ) School of Business Administration, Hebrew University of Jerusalem, Mount Scopus 91905, Israel e-mail: [email protected] N. Adler e-mail: [email protected] J. Kornbluth e-mail: [email protected] A.S. Hakkert Ran Naor Foundation for the Advancement of Road Safety, HodHasharon, Israel e-mail: [email protected] T. Raviv Department of Industrial Engineering, Tel Aviv University, Tel Aviv 69978, Israel e-mail: [email protected]